Maintaining Consistency of Dynamic Cardinality Constraints with Costs
نویسندگان
چکیده
This paper introduce a novel method for maintaining consistency of cardinality constraints in context of dynamic constraint satisfaction. The presented method adopt sensitivity analysis for feasible and minimum cost flows underlying all cardinality constraints. Moreover, we extend a dynamic all-pairs shortest path algorithm to support weight changes, insertion and deletion of multiple edges and show how this algorithm can be used to maintain consistency of values with the modified
منابع مشابه
Arc Consistency for Global Cardinality Constraints with Costs
A global cardinality constraint (gcc) is speciied in terms of a set of variables X = fx1;:::;xpg which take their values in a subset of V = fv1;:::;vdg. It constrains the number of times each value vi 2 V is assigned to a variable in X to be in an interval li; ui]. A gcc with costs (costgcc) is a generalization of a gcc in which a cost is associated with each value of each variable. Then, each ...
متن کاملSymmetric Cardinality Constraint with Costs
The symmetric cardinality constraint is described in terms of a set of variables X = {x1, . . . , xk}, which take their values as subsets of V = {v1, . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi , uxi ] and at the same time it restricts the number of occurrences of each value vj ∈ V in the sets assigned to variables in X to be in an ...
متن کاملOn Global Warming (Softening Global Constraints)
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints, the softening is achieved by augmenting the underlying graph. The softened constraints can be used to extend the meta-constraint framework for over-constrained problems proposed by Petit, Régin and Bessière.
متن کاملA Segment-based Dynamic Programing Algorithm for Parsing Gene Structure (Running Head: Segment-based Dynamic Programming)
Note: This version is a preliminary draft. Comments and suggestions are welcome. Abstract Predicting gene structure requires search within a combinatorially large space of possible gene structures. The search space may be narrowed by two types of computational tools: optimality criteria and consistency constraints. Consistency constraints are requirements concerning reading frame and stop codon...
متن کاملBound Consistency for Binary Length-Lex Set Constraints
The length-lex representation has been recently proposed for representing sets in Constraint Satisfaction Problems. The length-lex representation directly captures cardinality information, provides a total ordering for sets, and allows bound consistency on unary constraints to be enforced in time Õ(c), where c is the cardinality of the set. However, no algorithms were given to enforce bound con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005